منابع مشابه
Rounds in a combinatorial search problem
We consider the following combinatorial search problem: we are given some excellent elements of [n] and we should find at least one, asking questions of the following type: ”Is there an excellent element in A ⊂ [n]?”. G.O.H. Katona [6] proved sharp results for the number of questions needed to ask in the adaptive, non-adaptive and two-round versions of this problem. We verify a conjecture of Ka...
متن کاملRounds in Combinatorial
The search complexity of a separating system H ⊆ 2 is the minimum number of questions of type “x ∈ H? ” (where H ∈ H) needed in the worst case to determine a hidden element x ∈ [m]. If we are allowed to ask the questions in at most k batches then we speak of the k-round (or k-stage) complexity of H, denoted by ck(H). While 1-round and m-round complexities (called non-adaptive and adaptive compl...
متن کاملLocal Search for a complex combinatorial problem
Iterated Local Search (ILS) is a popular metaheuristic search technique for use on combinatorial optimisation problems. As with most such techniques, there are many ways in which ILS can be implemented. The aim of this paper is to shed light on the best variants and choice of parameters when using ILS on a complex combinatorial problem with many objectives, by reporting on the results of an exh...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملA Cuckoo Search Based Pairwise Strategy for Combinatorial Testing Problem
Combinatorial Testing (CT) is a sampling technique to generate test cases with a focus on the behavior of interaction system's components with their collaborators. Given its effectiveness to reveal faults, pairwise testing has often been chosen to perform the required sampling of test cases. The main concern for pairwise testing is to obtain the most optimal test sets (i.e. pairwise dictates th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.11.016